Subsumption for XML types

نویسندگان

  • Gabriel M. Kuper
  • Jérôme Siméon
چکیده

XML data is often used validated stored queried etc with respect to di erent types Understanding the relationship between these types can provide important information for manipulating this data We propose a notion of subsumption for XML to capture such relation ships Subsumption relies on a syntactic mapping between types and can be used for facilitating validation and query processing We study the properties of subsumption in particular the notion of the greatest lower bound of two schemas and show how this can be used as a guide for selecting a storage structure While less powerful than inclusion sub sumption generalizes several other mechanisms for reusing types notably extension and re nement from XML Schema and subtyping

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Expression Subtyping for XML Query and Update Languages

XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule may be used anywhere, and an algorithmic version in which the use of subsumption is limited in order to make typechecking syntax-directed and decidable. However, ...

متن کامل

Simulation Subsumption or Déjà vu on the Web

Simulation unification is a special kind of unification adapted to retrieving semi-structured data on the Web. This article introduces simulation subsumption, or containment, that is, query subsumption under simulation unification. Simulation subsumption is crucial in general for query optimization, in particular for optimizing pattern-based search engines, and for the termination of recursive ...

متن کامل

A DTD Graph Based XPath Query Subsumption Test

XPath expressions play a central role in querying for XML fragments. We present a containment test of two XPath queries which checks whether a new XPath query XP1 can reuse a previous query result XP2. The key idea is to transform XP1 into a graph which is used to search for sequences of elements which are used in the XPath query XP2.

متن کامل

Supporting UPA and restriction on an extension of XML Schema

We describe an extension of regular expresions using arbitrary all-groups and numeric exponents (as in W3C XML Schema). We are able to provide polynomial-time algorithms for testing UPA and content model subsumption for these extended regular expressions. The algorithm handles numeric exponents (as opposed to the Kleene operators of traditional regular expressions), but comparisons of exponents...

متن کامل

XML Declarative Description: A Language for the Semantic Web

software agents because they must first agree on the data’s syntax and semantics before hard-coding them into their applications. In addition, changes to syntax and semantics necessitate expensive application modifications. We need a Semantic Web1 with a well-established mechanism to express information that is machineinterpretable and allows syntactic and semantic interoperability among Web ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001